The Equitable Chromatic Bounds on Splitting of Block Circulant Graphs

An equitable vertex coloring for the splitting of block circulant graphs is investigated. The comprises matrices, where each itself a matrix. These blocks in row are cyclically shifted one place to right from those previous row. We approached such matrix representation and derived their independent sets using neighbourhoods vertex. This classification makes process be simpler most cases. In this framework, chromatic numbers obtained on graphs, namely prism, antiprism, crossed closed sun graphs.